Axiom sets equivalent to syllogism and Peirce.
نویسندگان
چکیده
منابع مشابه
Some Restricted Lindenbaum Theorems Equivalent to the Axiom of Choice
Dzik (1981) gives a direct proof of the axiom of choice from the generalized Lindenbaum extension theorem LET. The converse is part of every decent logical education. Inspection of Dzik’s proof shows that its premise let attributes a very special version of the Lindenbaum extension property to a very special class of deductive systems. The problem therefore arises of giving a direct proof, not ...
متن کاملThe Axiom for Connected Sets
sists of the set of all ra such that EdneT. The Gödel number of Ed is, of course, d and the Gödel number of ra (i.e. of a string of l's of length w) is 2" —1. Thus A consists of all ra such that d * (2n— 1)G7V We add to (S2) : Axiom. PI —11. Production. Px — y—>Pxl — yy. P represents the set of all ordered pairs (i, j) such that 2'=j. Then we add: Production. Px — yl, Cd — y — z, Toz—^Qx. In th...
متن کاملFuzzy Sets: Abstraction Axiom, Statistical Interpretation, Observations of Fuzzy Sets
The issues relating fuzzy sets definition are under consideration including the analogue for separation axiom, statistical interpretation and membership function representation by the conditional Probabilities.
متن کاملEquivalent fuzzy sets
Necessary and sufficient conditions under which two fuzzy sets (in the most general, poset valued setting) with the same domain have equal families of cut sets are given. The corresponding equivalence relation on the related fuzzy power set is investigated. Rela tionship of poset valued fuzzy sets and fuzzy sets for which the co-domain is Dedekind-MacNeille completion of that posets is deduced.
متن کاملUncountable γ - sets under axiom CPA gamecube
In the paper we formulate a Covering Property Axiom CPA cube , which holds in the iterated perfect set model, and show that it implies the existence of uncountable strong γ-sets in R (which are strongly meager) as well as uncountable γ-sets in R which are not strongly meager. These sets must be of cardinality ω1 < c, since every γ-set is universally null, while CPA cube implies that every unive...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1976
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093887528